/*
2021-7-14 
https://www.acwing.com/problem/content/12/
*/

#include<iostream>
#include<cstring>

using namespace std;
const int N=1010;
int v[N],w[N];
int f[N][N];
int n,m;

int main()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++) cin>>v[i]>>w[i];
    
    for(int i=n;i>=1;i--)
    {
        for(int j=0;j<=m;j++)
        {
            f[i][j]=f[i+1][j];
            if(j>=v[i])
                f[i][j]=max(f[i][j],f[i+1][j-v[i]]+w[i]);
        }
    }
    
    int j=m;
    for(int i=1;i<=n;i++)
    {
        if(j >= v[i] && f[i][j] == f[i+1][j-v[i]] + w[i])
        {
            cout<<i<<' ';
            j-=v[i];
        }
    }
    
    return 0;
}
